Ripping Coins For a Fair Exchange
نویسنده
چکیده
A fair exchange of payments for goods and services is a barter where one of the parties cannot obtain the item desired without handing over the item he ooered. We introduce the concept of ripping digital coins to solve fairness problems in payment transactions. We demonstrate how to implement coin ripping for a recently proposed payment scheme 9, 8], giving a practical and transparent coin ripping scheme. We then give a general solution that can be used in any payment scheme with a challenge. We also indicate how fairness can be obtained by building a contract into the coin.
منابع مشابه
Optimal Randomized Fair Exchange with Secret Shared Coins
In the fair exchange problem, mutually untrusting parties must securely exchange digital goods. A fair exchange protocol must ensure that no combination of cheating or failures will result in some goods being delivered but not others, and that all goods will be delivered in the absence of cheating and failures. This paper proposes two novel randomized protocols for solving fair exchange using s...
متن کاملAt the threshold of knowledge
We explore consequences of the view that to know a proposition your rational credence in the proposition must exceed a certain threshold. In other words, to know something you must have evidence that makes rational a high credence in it. We relate such a threshold view to Dorr et al.’s (Philosophical Studies 170(2):277–287, 2014) argument against the principle they call FAIR COINS: ‘‘If you kno...
متن کاملDeveloping a Paradigm for Fair Valuation in Tehran Stock Exchange
The concept of value is of great importance for investors. The goal of different groups of investors is always to maximize the value of their capital. The aim of this research is developing factors effective on securities in capital market in order to develop a paradigm for fair valuation that leads investors to make better decisions. To study fair value in a precise and comprehensive way, effe...
متن کاملOn Fair Exchange, Fair Coins and Fair Sampling
We study various classical secure computation problems in the context of fairness, and relate them with each other. We also systematically study fair sampling problems (i.e., inputless functionalities) and discover three levels of complexity for them. Our results include the following: – Fair exchange cannot be securely reduced to the problem of fair cointossing by an r-round protocol, except w...
متن کاملA traceable optimistic fair exchange protocol in the standard model
An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...
متن کامل